New Construction on Edge-Antimagic Labeling
نویسندگان
چکیده
An edge magic total labeling of a graph with p vertices and q edges is a bijection from the set of vertices and edges to 1, 2, . . . , p+ q such that for every edge the sums of the label of the edge and the label of its two end vertices are constant. Otherwise if the sum is distinct, it is said to be an edge-antimagic total labeling. A graph is called edgeantimagic if it admits edge-antimagic total labeling. In this paper we study some interesting constructions of graphs that results to edge-antimagic total labeling. Mathematics Subject Classification: 05C78
منابع مشابه
Magic Properties of Special Class of Trees
In this paper, we consider special class of trees called uniform k-distant trees, which have many interesting properties. We show that they have an edge-magic total labeling, a super edge-magic total labeling, a (a, d)-edge-antimagic vertex labeling, an (a, d)-edgeantimagic total labeling, a super (a, d)edge-antimagic total labeling. Also we introduce a new labeling called edge bi-magic vertex ...
متن کاملConstruction of new larger (a, d)-edge antimagic vertex graphs by using adjacency matrices
Let G = G(V, E) be a finite simple undirected graph with vertex set V and edge set E, where |E| and |V | are the number of edges and vertices on G. An (a, d)-edge antimagic vertex ((a, d)-EAV) labeling is a one-toone mapping f from V (G) onto {1, 2, . . . , |V |} with the property that for every edge xy ∈ E, the edge-weight set is equal to {f(x) + f(y) : x, y ∈ V } = {a, a+ d, a+2d, . . . , a+(...
متن کاملTotally antimagic total graphs
For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, . . . , |V (G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the edge and the labels of the end vertices of that edge. The vertex-weight of a vertex is the sum of the label of the vertex and the labels of all the edges incident with that vertex. A total label...
متن کاملA class of totally antimagic total graphs
A total labeling of a graph G is a bijection from the vertex set and edge set of G onto the set {1, 2, . . . , |V (G)| + |E(G)|}. Such a labeling ξ is vertex-antimagic (edge-antimagic) if all vertex-weights wtξ(v) = ξ(v) + ∑ vu∈E(G) ξ(vu), v ∈ V (G), (all edge-weights wtξ(vu) = ξ(v) + ξ(vu) + ξ(u), vu ∈ E(G)) are pairwise distinct. If a labeling is simultaneously vertex-antimagic and edge-antim...
متن کاملOn super antimagic total labeling of Harary graph
This paper deals with two types of graph labelings namely, the super (a, d)-edge antimagic total labeling and super (a, d)-vertex antimagic total labeling on the Harary graph C n. We also construct the super edge-antimagic and super vertex-antimagic total labelings for a disjoint union of k identical copies of the Harary graph.
متن کامل